When is an Almost Monochromatic K4 Guaranteed?
نویسندگان
چکیده
Suppose that n > (log k), where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges receive at most two colors. This improves the previous best bound of k k, where c′ is a fixed positive constant, which follows from results on classical Ramsey numbers.
منابع مشابه
Ramsey-Type Problem for an Almost Monochromatic K4
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n ≥ 2 ck contains a K4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and is the first exponential bound for this problem.
متن کاملRamsey-type Problem for an Almost Monochromatic
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n ≥ 2ck contains a K4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and is the first exponential bound for this problem.
متن کاملRamsey - type problem for an almost monochromatic K 4 Jacob
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n ≥ 2 contains a K4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and is the first exponential bound for this problem.
متن کاملA Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km
We study the mixed Ramsey number maxR(n,Km,Kr), defined as the maximum number of colours in an edge-colouring of the complete graph Kn, such that Kn has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that maxR(n,Km,K4) ≤ n3/2 √ 2m for all m ≥ 3. Further, we discuss a possible way to impr...
متن کاملThe Ramsey Multiplicity of K4
With the help of computer algorithms, we improve the lower bound on the Ramsey multiplicity of K4, and thus show that the exact value of it is equal to 9. The Ramsey multiplicity M(G) of a graph G is defined as the smallest number of monochromatic copies ofG in any two-coloring of edges of KR(G), whereR(G) is the Ramsey number of G, i.e. the smallest integer n such that any two-coloring of edge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 17 شماره
صفحات -
تاریخ انتشار 2008